Random Sampling in Cut, Flow, and Network Design Problems
نویسندگان
چکیده
منابع مشابه
A branch-and-cut algorithm for capacitated network design problems
We present a branch-and-cut algorithm to solve capacitated network design problems. Given a capacitated network and point-to-point traac demands, the objective is to install more capacity on the edges of the network and route traac simultaneously, so that the overall cost is minimized. We study a mixed-integer programming formulation of the problem and identify some new facet deening inequaliti...
متن کاملThe splitting design that leads to simple random sampling
Implementing unequal probability sampling, without replacement, is very complex and several methods have been suggested for its performance, including : Midseno design and systematic design. One of the methods that have been introduced by Devil and Tille (1998) is the splitting design that leads to simple random sampling .in this paper by completely explaining the design, with an example, we ha...
متن کاملCut-off Sampling Design: Take all, Take Some, and Take None
Extended Abstract. Sampling is the process of selecting units (e.g., people, organizations) from a population of interest so that by studying the sample we may fairly generalize our results back to the population from which they were chosen. To draw a sample from the underlying population, a variety of sampling methods can be employed, individually or in combination. Cut-off sampling is a pr...
متن کاملImproving branch-and-cut performance by random sampling
We discuss the variability in the performance of multiple runs of branchand-cut mixed integer linear programming solvers, and we concentrate on the one deriving from the use of different optimal bases of the linear programming relaxations. We propose a new algorithm exploiting more than one of those bases and we show that different versions of the algorithmcanbeused to stabilize and improve the...
متن کاملRandom Sampling in Graph Optimization Problems
The representative random sample is a central concept of statistics. It is often possible to gather a great deal of information about a large population by examining a small sample randomly drawn from it. This approach has obvious advantages in reducing the investigator's work, both in gathering and in analyzing the data. We apply the concept of a representative sample to combinatorial optimiza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1999
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.24.2.383